Total least squares problems on infinite dimensional spaces
نویسندگان
چکیده
Abstract We study weighted total least squares problems on infinite dimensional spaces. present some necessary and sufficient conditions for the regularized problem to have a solution. The existence of solution can also be assured minimization with constraint special subsets. Furthermore, we show that regularization in is necessary, since most cases without does not admit
منابع مشابه
Unifying Least Squares, Total Least Squares and Data Least Squares
The standard approaches to solving overdetermined linear systems Ax ≈ b construct minimal corrections to the vector b and/or the matrix A such that the corrected system is compatible. In ordinary least squares (LS) the correction is restricted to b, while in data least squares (DLS) it is restricted to A. In scaled total least squares (Scaled TLS) [15], corrections to both b and A are allowed, ...
متن کاملSolving Regularized Total Least Squares Problems Based on Eigenproblems
The total least squares (TLS) method is a successful approach for linear problems if both the system matrix and the right hand side are contaminated by some noise. For ill-posed TLS problems regularization is necessary to stabilize the computed solution. In this paper we summarize two iterative methods which are based on a sequence of eigenproblems. The focus is on efficient implementation with...
متن کاملGLOBAL TOTAL LEAST SQUARES Global Total Least Squares
A method for the construction of open approximate models from vector time series Preface PhD research is a largely open proces in which a stimulating environment plays a crucial role. I am indebted to several people and institutions that shaped such an environment for me during the years since April 1990. First and for all, I would like to thank my supervisor, Christiaan Heij. He set me on the ...
متن کاملFast Algorithms for Structured Least Squares and Total Least Squares Problems
We consider the problem of solving least squares problems involving a matrix M of small displacement rank with respect to two matrices Z 1 and Z 2. We develop formulas for the generators of the matrix M (H) M in terms of the generators of M and show that the Cholesky factorization of the matrix M (H) M can be computed quickly if Z 1 is close to unitary and Z 2 is triangular and nilpotent. These...
متن کاملLinear Least Least Simplified Neural Networks for Solving Squares Problems in Real Time Squares and Total
In this paper a new class of simplified low-cost analog artificial neural networks with on chip adaptive learning algorithms are proposed for solving linear systems of algebraic equations in real time. The proposed learning algorithms for linear least squares (LS), total least squares (TLS) and data least squares (DLS) problems can be considered as modifications and extensions of well known alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Inverse Problems
سال: 2021
ISSN: ['0266-5611', '1361-6420']
DOI: https://doi.org/10.1088/1361-6420/abe3dd